New Provably Secure Blind Signature Scheme with Weil Pairing

نویسندگان

  • Neetu Sharma
  • Birendra Kumar Sharma
  • M. A. Stalder
  • M. S. Hwang
  • C. C. Lee
چکیده

-------------------------------------------------------------------ABSTRACT-----------------------------------------------------Blind signature scheme provide the feature that a user is able to get a signature without giving the actual message to the signer. Many Blind signature schemes have been proposed in which security are based on intractability of factoring or DLP (Discrete Logarithm Problem ). In 2010, Fan et al.[11] gave a provably secure randomized blind signature whose security was based on solving ECDLP(Elliptic Curve Discrete Logarithm Problem). The security of this scheme is improved in order to propose a more secure and efficient scheme. The security of proposed scheme is based on expressing the torsion point of curve into linear combination of its basis points. This is more complicated than solving ECDLP (Elliptic Curve Discrete Logarithm Problem). Also, the simulation results from AVISPA tools confirm the security analysis of proposed protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convertible limited (multi-) verifier signature: new constructions and applications

A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...

متن کامل

One-Round ID-Based Blind Signature Scheme without ROS Assumption

In this paper, we propose a new ID-based blind signature scheme based on bilinear pairings from scratch (i.e. without using existing ID-based signature schemes, and without using existing computational assumptions). First, the round complexity of our ID-based blind signature scheme is optimal. Namely, each interactive signature generation requires the requesting user and the signer to transmit ...

متن کامل

New Short Signature Scheme with Weil Pairing

Short signature is an essential component in cryptography. Short digital signatures are needed in environments where a human is asked to manually key in the signature.. In this paper we propose a new short signature scheme with weil pairing. Also we analyze security and efficiency of our scheme. Security of our scheme is based on expressing the torsion point of curve into linear combination of ...

متن کامل

Provably Secure Partially Blind Signature Scheme Based on Quadratic Residue

Partially blind signature schemes are the most important ingredient for anonymity in off-line e-cash system. In this paper, a new approach to setup formal security arguments in random oracle model for factorization based partially blind signature schemes is presented. Then a provably secure and efficient scheme based on quadratic residue is proposed. The approach also allows one to give formal ...

متن کامل

A Provably Secure Restrictive Partially Blind Signature Scheme

The concept of partially blind signatures was first introduced by Abe and Fujisaki. Subsequently, in work by Abe and Okamoto, a provably secure construction was proposed along with a formalised definition for partially blind schemes. The construction was based on a witness indistinguishable protocol described by Cramer et al. and utilises a blind Schnorr signature scheme. This paper investigate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014